Merging percolation onZdand classical random graphs: Phase transition
نویسندگان
چکیده
منابع مشابه
Merging percolation on Zd and classical random graphs: Phase transition
We study a random graph model which is a superposition of bond percolation on Zd with parameter p, and a classical random graph G(n, c/n). We show that this model, being a homogeneous random graph, has a natural relation to the so-called “rank 1 case” of inhomogeneous random graphs. This allows us to use the newly developed theory of inhomogeneous random graphs to describe the phase diagram on ...
متن کاملMerging percolation on Z and classical random graphs: Phase transition
We study a random graph model which is a superposition of the bond percolation model on Zd with probability p of an edge, and a classical random graph G(n, c/n). We show that this model, being a homogeneous random graph, has a natural relation to the so-called ”rank 1 case” of inhomogeneous random graphs. This allows us to use the newly developed theory of inhomogeneous random graphs to describ...
متن کاملMerging percolation and classical random graphs : Phase transition in dimension 1
We study a random graph model which combines properties of the edge percolation model on Z d and a classical random graph G(n, c/n). We show that this model, being a homogeneous random graph, has a natural relation to the so-called " rank 1 case " of inhomogeneous random graphs. This allows us to use the newly developed theory of inhomogeneous random graphs to describe completely the phase diag...
متن کاملCore percolation: a new geometric phase transition in random graphs
We study both numerically and analytically what happens to a random graph of average connectivity α when its leaves and their neighbors are removed iteratively up to the point when no leaf remains. The remnant is made of isolated vertices plus an induced subgraph we call the core. In the thermodynamic limit of an infinite random graph, we compute analytically the dynamics of leaf removal, the n...
متن کاملThe Phase Transition in Site Percolation on Pseudo-Random Graphs
We establish the existence of the phase transition in site percolation on pseudo-random dregular graphs. Let G = (V,E) be an (n, d, λ)-graph, that is, a d-regular graph on n vertices in which all eigenvalues of the adjacency matrix, but the first one, are at most λ in their absolute values. Form a random subset R of V by putting every vertex v ∈ V into R independently with probability p. Then f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures and Algorithms
سال: 2009
ISSN: 1042-9832,1098-2418
DOI: 10.1002/rsa.20287